package com.singzi.leetcode.jianzhiOffer;

public class T0047 {
}
class Solution0047 {
    public int maxValue(int[][] grid) {
        int m = grid.length, n = grid[0].length;

        int [][]maxValues = new int[m][n];
        maxValues[0][0] = grid[0][0];
        for (int i = 1; i < n; i++) {
            maxValues[0][i] = maxValues[0][i-1]+grid[0][i];
        }
        for (int i = 1; i < m; i++) {
            maxValues[i][0] = maxValues[i-1][0]+grid[i][0];
        }
        for(int i = 1;i < m;i++){
            for (int j = 1;j < n;j++){
                maxValues[i][j] = Math.max(maxValues[i-1][j], maxValues[i][j-1]) + grid[i][j];
            }
        }
        return maxValues[m-1][n-1];

    }
}